منابع مشابه
Computing homotopic line simplification
rticle history: eceived 3 December 2011 eceived in revised form 29 October 2012 ccepted 7 February 2014 vailable online xxxx ommunicated by P. Agarwal eywords: omputational geometry implification omotopy ath ine urve hain In this paper, we study a variant of the well-known line-simplification problem. For this problem, we are given a polygonal path P = p1, p2, . . . , pn and a set S of m point ...
متن کاملA Heuristic Homotopic Path Simplification Algorithm
We study the well-known problem of approximating a polygonal path P by a coarse one, whose vertices are a subset of the vertices of P . In this problem, for a given error, the goal is to find a path with the minimum number of vertices while preserving the homotopy in presence of a given set of extra points in the plane. We present a heuristic method for homotopy-preserving simplification under ...
متن کاملComputing Homotopic Shortest Paths Efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in linear time using the “funnel” algorithm of Chazelle [3] and Lee and Preparata [10]. A more general problem is to find a shortest path between two points in a polygonal domain. In this case the “rubber band” solution ...
متن کاملComputing homotopic shortest paths in the plane
We address the problem of computing homotopic shortest paths in presence of obstacles in the plane. The problems on homotopy of the paths received attention very recently [3, 8]. We present two output-sensitive algorithms, for simple paths and non-simple paths. The algorithm for simple paths improves the previous algorithm [8]. The algorithm for non-simple paths achieves O(log n) time per outpu...
متن کاملLine Simplification Algorithms
Work on the generalisation of cartographic line data, so that small scale map data can be derived from larger scales, has led to the development of algorithms for a variety of generalisation operations, including line simplification. A major objective when capturing linear digital map data is the creation of accurate representation of naturally occurring lines, using a minimum of processing tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2014
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2014.02.002